Distributed top-k query processing by exploiting skyline summaries
نویسندگان
چکیده
منابع مشابه
Adaptive Distributed Top-k Query Processing
ADiT is an adaptive approach for processing distributed topk queries over peer-to-peer networks optimizing both system load and query response time. This approach considers the size of the peer to peer network, the amount k of searched objects, the network capabilities of a connected peer, i.e. the transmission rate, the amount of objects stored on each peer, and the speed of a peer in processi...
متن کاملEfficient Distributed Top-k Query Processing with Caching
Recently, there has been an increased interest in incorporating in database management systems rank-aware query operators, such as top-k queries, that allow users to retrieve only the most interesting data objects. In this paper, we propose a cache-based approach for efficiently supporting top-k queries in distributed database management systems. In large distributed systems, the query performa...
متن کاملEfficient Top-k Query Processing Algorithms in Highly Distributed Environments
Efficient top-k query processing in highly distributed environments is a valuable but challenging research topic. This paper focuses on the problem over vertically partitioned data and aims to propose more efficient algorithms.. The effort is put on limiting the data transferred and communication round trips among nodes to reduce the communication cost of the query processing. Two novel algorit...
متن کاملSkyline query processing
This thesis deals with a special subset of multi-dimensional set of points, called the Skyline. These points are the maxima or minima of the complete set and are of special interest for the field of decision support. Coming from basic algorithms for computing the Skyline we will develop ideas and algorithms for “on-the-fly” or online computation of the Skyline. We will also extend the concept o...
متن کاملSkyline and Top-k Processing in Web Bargaining
Skyline and top-k queries are gaining increasing importance in many emerging applications. Current skyline and top-k query processing techniques work on deterministic object attributes and known scores. However, in many practical scenarios these settings are inapplicable. In this paper we focus on web interaction scenarios where each interaction is a data object with a set of possible outcomes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed and Parallel Databases
سال: 2012
ISSN: 0926-8782,1573-7578
DOI: 10.1007/s10619-012-7094-2